Kleene Algebra with Equations
نویسندگان
چکیده
We identify sufficient conditions for the construction of free language models for systems of Kleene algebra with additional equations. The construction applies to a broad class of extensions of KA and provides a uniform approach to deductive completeness.
منابع مشابه
On the Complexity of Reasoning in Kleene Algebra
We study the complexity of reasoning in Kleene algebra and -continuous Kleene algebra in the presence of extra equational assumptions E; that is, the complexity of deciding the validity of universal Horn formulas E s t, where E is a finite set of equations. We obtain various levels of complexity based on the form of the assumptions E. Our main results are: for -continuous Kleene algebra, (i) if...
متن کاملFeasibly Reducing KAT Equations to KA Equations
Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean subalgebra. The addition of tests allows one to encode while programs as KAT terms, thus the equational theory of KAT can express (propositional) program equivalenc...
متن کاملA Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
We give a nitary axiomatization of the algebra of regular events involving only equations and equational implications Unlike Salo maa s axiomatizations the axiomatization given here is sound for all interpretations over Kleene algebras
متن کاملAutomatic Proof Generation in Kleene Algebra with Tests
Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean subalgebra. The addition of tests allows one to encode while programs as KAT terms, thus the equational theory of KAT can express (propositional) program equivalenc...
متن کاملSimplifying Pointer Kleene Algebra
Pointer Kleene algebra has proved to be a useful abstraction for reasoning about reachability properties and correctly deriving pointer algorithms. Unfortunately it comes with a complex set of operations and defining (in)equations which exacerbates its practicability with automated theorem proving systems but also its use by theory developers. Therefore we provide an easier access to this appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014